Generalized linear cellular automata in groups and difference Galois theory

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

σ-Galois theory of linear difference equations

Inspired by the numerous applications of the differential algebraic independence results from [36], we develop a Galois theory with an action of an endomorphism σ for systems of linear difference equations of the form φ(y) = Ay , where A ∈ GLn(K ) and K is a φσ-field, that is, a field with two given commuting endomorphisms φ and σ, like in Example 2.1. This provides a technique to test whether ...

متن کامل

Injective Linear Cellular Automata and Sofic Groups

Let V be a finite-dimensional vector space over a field K and let G be a sofic group. We show that every injective linear cellular automaton τ : V G → V G is surjective. As an application, we obtain a new proof of the stable finiteness of group rings of sofic groups, a result previously established by G. Elek and A. Szabó using different methods.

متن کامل

Galois Embeddings for Linear Groups

A criterion is given for the solvability of a central Galois embedding problem to go from a projective linear group covering to a vectorial linear

متن کامل

Hyperelliptic Jacobians and Projective Linear Galois Groups

In [9] the author proved that in characteristic 0 the jacobian J(C) = J(Cf ) of a hyperelliptic curve C = Cf : y 2 = f(x) has only trivial endomorphisms over an algebraic closure Ka of the ground field K if the Galois group Gal(f) of the irreducible polynomial f ∈ K[x] is “very big”. Namely, if n = deg(f) ≥ 5 and Gal(f) is either the symmetric group Sn or the alternating group An then the ring ...

متن کامل

Linear Cellular Automata and Finite Automata

Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Difference Equations and Applications

سال: 2014

ISSN: 1023-6198,1563-5120

DOI: 10.1080/10236198.2014.990897